منابع مشابه
Total time minimization of fuzzy transportation problem
This paper proposes a procedure for solving total time minimization in fuzzy transportation problem where the transportation time, source and destination parameters have been expressed as exponential fuzzy numbers by the decision maker. An algorithm is developed to obtain the optimal solution as exponential fuzzy number, which enables the decision maker to obtain more informing results and wide...
متن کاملFully Fuzzy Transportation Problem
Transportation problem is a linear programming which considers minimum cost for shipping a product from some origins to other destinations such as from factories to warehouse, or from a warehouse to supermarkets. To solve this problem simplex algorithmis utilized. In real projects costs and the value of supply and demands are fuzzy numbers and it is expected that optimal solutions for determini...
متن کاملThe Noncooperative Transportation Problem
We extend the classical transportation problem from linear optimization and introduce several competing forwarders. This results in a noncooperative game which is commonly known as generalized Nash equilibrium problem. We show the existence of Nash equilibria and present numerical methods for their efficient computation. Furthermore, we discuss several equilibrium selection concepts that are ap...
متن کاملThe Senior Transportation Problem
The senior transportation problem (STP) is an optimization problem in which a fixed fleet of volunteer-operated, heterogeneous vehicles from multiple depots must satisfy as many elderly door-to-door transportation requests as possible within a fixed time horizon. All requests consist of a oneto-one pickup and delivery with time windows. Moreover, as the clients are seniors, a maximum ride time ...
متن کاملThe Online Transportation Problem
We study the online transportation problem. We show that the halfopt-competitive ratio for the greedy algorithm is (min(m; logC)), where m is the number of server sites, and C is the total number of servers. We also present an algorithm Balance that is a modi cation of the greedy algorithm and that has a halfopt-competitive ratio of O(1).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicationes Mathematicae
سال: 1965
ISSN: 1233-7234,1730-6280
DOI: 10.4064/am-8-3-231-242